Exact Matrix Completion via Convex Optimization
نویسندگان
چکیده
منابع مشابه
Exact Tensor Completion from Sparsely Corrupted Observations via Convex Optimization
This paper conducts a rigorous analysis for provable estimation of multidimensional arrays, in particular third-order tensors, from a random subset of its corrupted entries. Our study rests heavily on a recently proposed tensor algebraic framework in which we can obtain tensor singular value decomposition (t-SVD) that is similar to the SVD for matrices, and define a new notion of tensor rank re...
متن کاملMatrix Completion via Non-convex Programming
We consider the matrix completion problem in the noisy setting. To achieve statistically efficient estimation of the unknown low-rank matrix, solving convex optimization problems with nuclear norm constraints has been both theoretically and empirically proved a successful strategy under certain regularity conditions. However, the bias induced by the nuclear norm penalty may compromise the estim...
متن کاملMatrix completion via max-norm constrained optimization
This paper studies matrix completion under a general sampling model using the max-norm as a convex relaxation for the rank of the matrix. The optimal rate of convergence is established for the Frobenius norm loss. It is shown that the max-norm constrained minimization method is rate-optimal and it yields a more stable approximate recovery guarantee, with respect to the sampling distributions, t...
متن کاملCompletion of partially known turbulent flow statistics via convex optimization
Second-order statistics of turbulent flows can be obtained in direct numerical simulations and experiments. Even though these statistics provide invaluable insights about flow physics, they have not yet been incorporated in models to be used for control. In this report, we develop a method to account for partially available velocity correlations via stochastically forced linear dynamical models...
متن کاملFast Exact Matrix Completion with Finite Samples
Matrix completion is the problem of recovering a low rank matrix by observing a small fraction of its entries. A series of recent works (Keshavan, 2012; Jain et al., 2013; Hardt, 2014) have proposed fast non-convex optimization based iterative algorithms to solve this problem. However, the sample complexity in all these results is sub-optimal in its dependence on the rank, condition number and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations of Computational Mathematics
سال: 2009
ISSN: 1615-3375,1615-3383
DOI: 10.1007/s10208-009-9045-5